Determining possible sets of leaves for spanning trees of dually chordal graphs
نویسندگان
چکیده
It will be proved that the problem of determining whether a set of vertices of a dually chordal graphs is the set of leaves of a tree compatible with it can be solved in polynomial time by establishing a connection with finding clique trees of chordal graphs with minimum number of leaves.
منابع مشابه
Distance Approximating Trees for Chordal and Dually Chordal Graphs
In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...
متن کاملDistance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract)
In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملOn minimal vertex separators of dually chordal graphs: Properties and characterizations
Many works related to dually chordal graphs, their cliques and neighborhoods were published [1, 6]. We will undertake a similar study by considering minimal vertex separators and their properties instead. We find a necessary and sufficient condition for every minimal vertex separator to be contained in the closed neighborhood of a vertex and two major characterizations of dually chordal graphs ...
متن کاملCollective Additive Tree Spanners of Homogeneously Orderable Graphs
In this paper we investigate the (collective) tree spanners problem in homogeneously orderable graphs. This class of graphs was introduced by A. Brandstädt et al. to generalize the dually chordal graphs and the distance-hereditary graphs and to show that the Steiner tree problem can still be solved in polynomial time on this more general class of graphs. In this paper, we demonstrate that every...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 122 شماره
صفحات -
تاریخ انتشار 2015